0.11/0.23	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.24	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.47	% Computer   : n008.cluster.edu
0.12/0.47	% Model      : x86_64 x86_64
0.12/0.47	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.47	% Memory     : 8042.1875MB
0.12/0.47	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.47	% CPULimit   : 1200
0.12/0.47	% WCLimit    : 120
0.12/0.47	% DateTime   : Tue Jul 13 10:13:44 EDT 2021
0.12/0.47	% CPUTime    : 
0.12/0.48	% Number of cores: 8
0.12/0.48	% Python version: Python 3.6.8
0.12/0.48	# Version: 2.6rc1-ho
0.12/0.48	# No SInE strategy applied
0.12/0.48	# Trying AutoSched0 for 59 seconds
0.12/0.51	# AutoSched0-Mode selected heuristic MinMin_rr
0.12/0.51	# and selection function SelectMaxLComplexAvoidPosPred.
0.12/0.51	#
0.12/0.51	# Preprocessing time       : 0.027 s
0.12/0.51	# Presaturation interreduction done
0.12/0.51	
0.12/0.51	# Proof found!
0.12/0.51	# SZS status Theorem
0.12/0.51	# SZS output start CNFRefutation
0.12/0.51	thf(cTHM623_pme, conjecture, (![X1:$i]:((cODD @ X1|cEVEN @ X1)=>cN @ X1)<=((cN @ c0&![X2:$i]:(cN @ (cS @ X2)<=cN @ X2))&![X3:$i > $o, X4:$i > $o]:(((![X5:$i]:(X4 @ X5=>X3 @ (cS @ X5))&![X6:$i]:(X3 @ X6=>X4 @ (cS @ X6)))&X3 @ c0)=>(![X7:$i]:(X4 @ X7<=cODD @ X7)&![X7:$i]:(cEVEN @ X7=>X3 @ X7))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM623_pme)).
0.12/0.51	thf(c_0_1, negated_conjecture, ~((((cN @ c0&![X2:$i]:(cN @ X2=>cN @ (cS @ X2)))&![X3:$i > $o, X4:$i > $o]:(((![X5:$i]:(X4 @ X5=>X3 @ (cS @ X5))&![X6:$i]:(X3 @ X6=>X4 @ (cS @ X6)))&X3 @ c0)=>(![X7:$i]:(cODD @ X7=>X4 @ X7)&![X7:$i]:(cEVEN @ X7=>X3 @ X7))))=>![X1:$i]:((cODD @ X1|cEVEN @ X1)=>cN @ X1))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM623_pme])])).
0.12/0.51	thf(c_0_2, negated_conjecture, ![X16:$i, X17:$i > $o, X18:$i > $o, X21:$i, X22:$i]:(((cN @ c0&(~cN @ X16|cN @ (cS @ X16)))&((((~cODD @ X21|X18 @ X21|(X17 @ (esk2_2 @ X17 @ X18)|X18 @ (esk1_2 @ X17 @ X18)|~X17 @ c0))&(~cEVEN @ X22|X17 @ X22|(X17 @ (esk2_2 @ X17 @ X18)|X18 @ (esk1_2 @ X17 @ X18)|~X17 @ c0)))&((~cODD @ X21|X18 @ X21|(~X18 @ (cS @ (esk2_2 @ X17 @ X18))|X18 @ (esk1_2 @ X17 @ X18)|~X17 @ c0))&(~cEVEN @ X22|X17 @ X22|(~X18 @ (cS @ (esk2_2 @ X17 @ X18))|X18 @ (esk1_2 @ X17 @ X18)|~X17 @ c0))))&(((~cODD @ X21|X18 @ X21|(X17 @ (esk2_2 @ X17 @ X18)|~X17 @ (cS @ (esk1_2 @ X17 @ X18))|~X17 @ c0))&(~cEVEN @ X22|X17 @ X22|(X17 @ (esk2_2 @ X17 @ X18)|~X17 @ (cS @ (esk1_2 @ X17 @ X18))|~X17 @ c0)))&((~cODD @ X21|X18 @ X21|(~X18 @ (cS @ (esk2_2 @ X17 @ X18))|~X17 @ (cS @ (esk1_2 @ X17 @ X18))|~X17 @ c0))&(~cEVEN @ X22|X17 @ X22|(~X18 @ (cS @ (esk2_2 @ X17 @ X18))|~X17 @ (cS @ (esk1_2 @ X17 @ X18))|~X17 @ c0))))))&((cODD @ esk3_0|cEVEN @ esk3_0)&~cN @ esk3_0)), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.12/0.51	thf(c_0_3, negated_conjecture, ![X1:$i, X4:$i > $o, X3:$i > $o]:(X3 @ X1|X3 @ (esk2_2 @ X3 @ X4)|X4 @ (esk1_2 @ X3 @ X4)|~cEVEN @ X1|~X3 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_4, negated_conjecture, (cODD @ esk3_0|cEVEN @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_5, negated_conjecture, ![X1:$i, X4:$i > $o, X3:$i > $o]:(X3 @ X1|~cEVEN @ X1|~X4 @ (cS @ (esk2_2 @ X3 @ X4))|~X3 @ (cS @ (esk1_2 @ X3 @ X4))|~X3 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_6, negated_conjecture, ![X1:$i]:(cN @ (cS @ X1)|~cN @ X1), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_7, negated_conjecture, ![X1:$i, X4:$i > $o, X3:$i > $o]:(X3 @ X1|X3 @ (esk2_2 @ X3 @ X4)|~cEVEN @ X1|~X3 @ (cS @ (esk1_2 @ X3 @ X4))|~X3 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_8, negated_conjecture, cN @ c0, inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_9, negated_conjecture, ![X1:$i, X4:$i > $o, X3:$i > $o]:(X3 @ X1|X4 @ (esk1_2 @ X3 @ X4)|~cEVEN @ X1|~X4 @ (cS @ (esk2_2 @ X3 @ X4))|~X3 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_10, negated_conjecture, ![X4:$i > $o, X3:$i > $o]:(X3 @ (esk2_2 @ X3 @ X4)|X4 @ (esk1_2 @ X3 @ X4)|cODD @ esk3_0|X3 @ esk3_0|~X3 @ c0), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.12/0.51	thf(c_0_11, negated_conjecture, ~cN @ esk3_0, inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i > $o]:(X3 @ X1|~X3 @ (cS @ (esk1_2 @ X3 @ cN))|~cN @ (esk2_2 @ X3 @ cN)|~cEVEN @ X1|~X3 @ c0), inference(spm,[status(thm)],[c_0_5, c_0_6])).
0.12/0.51	thf(c_0_13, negated_conjecture, ![X3:$i > $o, X1:$i]:(cN @ (esk2_2 @ cN @ X3)|cN @ X1|~cN @ (esk1_2 @ cN @ X3)|~cEVEN @ X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_6]), c_0_8])])).
0.12/0.51	thf(c_0_14, negated_conjecture, ![X1:$i, X3:$i > $o]:(cN @ (esk1_2 @ X3 @ cN)|X3 @ X1|~cN @ (esk2_2 @ X3 @ cN)|~cEVEN @ X1|~X3 @ c0), inference(spm,[status(thm)],[c_0_9, c_0_6])).
0.12/0.51	thf(c_0_15, negated_conjecture, ![X3:$i > $o]:(cN @ (esk2_2 @ cN @ X3)|X3 @ (esk1_2 @ cN @ X3)|cODD @ esk3_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_8]), c_0_11])).
0.12/0.51	thf(c_0_16, negated_conjecture, ![X1:$i]:(cN @ X1|~cN @ (esk1_2 @ cN @ cN)|~cEVEN @ X1), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_6]), c_0_8])]), c_0_13])).
0.12/0.51	thf(c_0_17, negated_conjecture, ![X1:$i]:(cODD @ esk3_0|cN @ X1|~cEVEN @ X1), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_8])]), c_0_16])).
0.12/0.51	thf(c_0_18, negated_conjecture, ![X1:$i, X3:$i > $o, X4:$i > $o]:(X3 @ X1|X4 @ (esk2_2 @ X4 @ X3)|X3 @ (esk1_2 @ X4 @ X3)|~cODD @ X1|~X4 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_19, negated_conjecture, cODD @ esk3_0, inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_17]), c_0_4])).
0.12/0.51	thf(c_0_20, negated_conjecture, ![X1:$i, X3:$i > $o, X4:$i > $o]:(X3 @ X1|~cODD @ X1|~X3 @ (cS @ (esk2_2 @ X4 @ X3))|~X4 @ (cS @ (esk1_2 @ X4 @ X3))|~X4 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_21, negated_conjecture, ![X1:$i, X3:$i > $o, X4:$i > $o]:(X3 @ X1|X4 @ (esk2_2 @ X4 @ X3)|~cODD @ X1|~X4 @ (cS @ (esk1_2 @ X4 @ X3))|~X4 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_22, negated_conjecture, ![X1:$i, X3:$i > $o, X4:$i > $o]:(X3 @ X1|X3 @ (esk1_2 @ X4 @ X3)|~cODD @ X1|~X3 @ (cS @ (esk2_2 @ X4 @ X3))|~X4 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.12/0.51	thf(c_0_23, negated_conjecture, ![X3:$i > $o, X4:$i > $o]:(X3 @ (esk1_2 @ X4 @ X3)|X4 @ (esk2_2 @ X4 @ X3)|X3 @ esk3_0|~X4 @ c0), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.12/0.51	thf(c_0_24, negated_conjecture, ![X3:$i > $o, X1:$i]:(X3 @ X1|~X3 @ (cS @ (esk2_2 @ cN @ X3))|~cN @ (esk1_2 @ cN @ X3)|~cODD @ X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_6]), c_0_8])])).
0.12/0.51	thf(c_0_25, negated_conjecture, ![X3:$i > $o, X1:$i]:(cN @ (esk2_2 @ cN @ X3)|X3 @ X1|~cN @ (esk1_2 @ cN @ X3)|~cODD @ X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_6]), c_0_8])])).
0.12/0.51	thf(c_0_26, negated_conjecture, ![X1:$i, X3:$i > $o]:(cN @ (esk1_2 @ X3 @ cN)|cN @ X1|~cN @ (esk2_2 @ X3 @ cN)|~cODD @ X1|~X3 @ c0), inference(spm,[status(thm)],[c_0_22, c_0_6])).
0.12/0.51	thf(c_0_27, negated_conjecture, ![X3:$i > $o]:(cN @ (esk2_2 @ cN @ X3)|X3 @ (esk1_2 @ cN @ X3)|X3 @ esk3_0), inference(spm,[status(thm)],[c_0_23, c_0_8])).
0.12/0.51	thf(c_0_28, negated_conjecture, ![X1:$i]:(cN @ X1|~cN @ (esk1_2 @ cN @ cN)|~cODD @ X1), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_6]), c_0_25])).
0.12/0.51	thf(c_0_29, negated_conjecture, ![X1:$i]:(cN @ X1|~cODD @ X1), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_8])]), c_0_11]), c_0_28])).
0.12/0.51	thf(c_0_30, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_29]), c_0_19])]), ['proof']).
0.12/0.51	# SZS output end CNFRefutation
0.12/0.51	# Proof object total steps             : 31
0.12/0.51	# Proof object clause steps            : 28
0.12/0.51	# Proof object formula steps           : 3
0.12/0.51	# Proof object conjectures             : 31
0.12/0.51	# Proof object clause conjectures      : 28
0.12/0.51	# Proof object formula conjectures     : 3
0.12/0.51	# Proof object initial clauses used    : 12
0.12/0.51	# Proof object initial formulas used   : 1
0.12/0.51	# Proof object generating inferences   : 16
0.12/0.51	# Proof object simplifying inferences  : 21
0.12/0.51	# Training examples: 0 positive, 0 negative
0.12/0.51	# Parsed axioms                        : 6
0.12/0.51	# Removed by relevancy pruning/SinE    : 0
0.12/0.51	# Initial clauses                      : 17
0.12/0.51	# Removed in clause preprocessing      : 5
0.12/0.51	# Initial clauses in saturation        : 12
0.12/0.51	# Processed clauses                    : 59
0.12/0.51	# ...of these trivial                  : 6
0.12/0.51	# ...subsumed                          : 7
0.12/0.51	# ...remaining for further processing  : 46
0.12/0.51	# Other redundant clauses eliminated   : 37
0.12/0.51	# Clauses deleted for lack of memory   : 0
0.12/0.51	# Backward-subsumed                    : 8
0.12/0.51	# Backward-rewritten                   : 4
0.12/0.51	# Generated clauses                    : 148
0.12/0.51	# ...of the previous two non-trivial   : 81
0.12/0.51	# Contextual simplify-reflections      : 6
0.12/0.51	# Paramodulations                      : 71
0.12/0.51	# Factorizations                       : 0
0.12/0.51	# NegExts                              : 0
0.12/0.51	# Equation resolutions                 : 37
0.12/0.51	# Propositional unsat checks           : 0
0.12/0.51	#    Propositional check models        : 0
0.12/0.51	#    Propositional check unsatisfiable : 0
0.12/0.51	#    Propositional clauses             : 0
0.12/0.51	#    Propositional clauses after purity: 0
0.12/0.51	#    Propositional unsat core size     : 0
0.12/0.51	#    Propositional preprocessing time  : 0.000
0.12/0.51	#    Propositional encoding time       : 0.000
0.12/0.51	#    Propositional solver time         : 0.000
0.12/0.51	#    Success case prop preproc time    : 0.000
0.12/0.51	#    Success case prop encoding time   : 0.000
0.12/0.51	#    Success case prop solver time     : 0.000
0.12/0.51	# Current number of processed clauses  : 22
0.12/0.51	#    Positive orientable unit clauses  : 2
0.12/0.51	#    Positive unorientable unit clauses: 0
0.12/0.51	#    Negative unit clauses             : 2
0.12/0.51	#    Non-unit-clauses                  : 18
0.12/0.51	# Current number of unprocessed clauses: 17
0.12/0.51	# ...number of literals in the above   : 81
0.12/0.51	# Current number of archived formulas  : 0
0.12/0.51	# Current number of archived clauses   : 24
0.12/0.51	# Clause-clause subsumption calls (NU) : 99
0.12/0.51	# Rec. Clause-clause subsumption calls : 49
0.12/0.51	# Non-unit clause-clause subsumptions  : 21
0.12/0.51	# Unit Clause-clause subsumption calls : 7
0.12/0.51	# Rewrite failures with RHS unbound    : 0
0.12/0.51	# BW rewrite match attempts            : 1
0.12/0.51	# BW rewrite match successes           : 1
0.12/0.51	# Condensation attempts                : 0
0.12/0.51	# Condensation successes               : 0
0.12/0.51	# Termbank termtop insertions          : 3824
0.12/0.51	
0.12/0.51	# -------------------------------------------------
0.12/0.51	# User time                : 0.030 s
0.12/0.51	# System time              : 0.005 s
0.12/0.51	# Total time               : 0.035 s
0.12/0.51	# Maximum resident set size: 1640 pages
0.12/0.52	EOF